Easy Sets Without Easy Small Subsets
نویسنده
چکیده
We show the existence of relativized worlds relative to which there exist innnite polynomial-time computable sets without innnite polynomial-time computable sparse subsets or even non-deterministically polynomial-time computable sparse subsets. This result is tight since every innnite P set has an innnite sparse coNP subset.
منابع مشابه
New methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملResolution of Fuzzy Complex Systems of Linear Equations Via Wu's Method
The aim of this paper is to present algebraic method which is called Wu's method to solving fuzzy complex systems of linear equations. Wu's method is used as a solution procedure for solving the crisp polynomial equations system. This algorithm leads to solving characteristic sets that are amenable to easy solution. To illustrate the easy application of the proposed method, numerical examples a...
متن کاملEasy Sets and Hard Certificate Schemes1
Can easy sets only have easy certificate schemes? In this paper, we study the class of sets that, for all NP certificate schemes (i.e., NP machines), always have easy acceptance certificates (i.e., accepting paths) that can be computed in polynomial time. We also study the class of sets that, for all NP certificate schemes, infinitely often have easy acceptance certificates. We give structural ...
متن کاملOn an optimal propositional proof system and the structure of easy subsets of TAUT
In this paper we develop a connection between optimal propositional proof systems and structural complexity theory-speciically, there exists an optimal propositional proof system if and only if there is a suitable recursive presentation of the class of all easy (polynomial time recognizable) subsets of TAUT. As a corollary we obtain the result that if there does not exist an optimal proposition...
متن کاملThe Comparison Between the Pregnancy Outcome after Easy Embryo Transfer and Difficult Embryo Transfer
Background: The role of embryo transfer (ET) in the success of in vitro fertilization/intra cytoplasmic sperm injection treatment is not well understood. In the present study we classified ET technique as difficult and easy types according to certain strict criteria, and compared the pregnancy outcome of the two ET types. Methods: This study was performed retrospectively on 295 infertile patien...
متن کامل